Don't Care Computation in Minimizing Extended Finite State Machines with Presburger Arithmetic

نویسندگان

  • Yunjian Jiang
  • Robert K. Brayton
چکیده

This paper addresses the problem of generating logic don’t cares in minimizing an Extended Finite State Machines (EFSMs). EFSMs have been proposed to model control oriented systems. A version of this, with the data portion modeled by Presburger arithmetic, has been used in formal verification. A structural representation of such EFSMs and an optimization scheme using multi-valued logic is proposed in this paper. It consists of new methods to transfer don’t cares through the data-path and to generate logic don’t cares from the data path. Potential applications are discussed and preliminary results validate the scheme on some reasonable examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparison of Presburger Engines for EFSM Reachability

Implicit state enumeration for extended finite state machines relies on a decision procedure for Presburger arithmetic. We compare the performance of two Presburger packages, the automata-based Shasta package and the polyhedrabased Omega package. While the raw speed of each of these two packages can be superior to the other by a factor of 50 or more, we found the asymptotic performance of Shast...

متن کامل

Optimal Metric Planning with State Sets in Automata Representation

This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represented using minimized finite state machines. The exploration that contributes to the planning via model checking paradigm applies symbolic images in order to compute the deterministic finite automaton for the sets of succ...

متن کامل

Eliminating the storage tape in reachability constructions

A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton can be accepted by a 2-tape pushdown acceptor with reversal-bounded counters. We improve this result by showing that the stack can be eliminated from the acceptor, i.e., the binary reachability can be accepted by a 2...

متن کامل

DRAFT—NOT FOR PUBLIC CIRCULATION Date: 2004/09/25 00:18:56; Revision: 1.90.2.3 Computation in Networks of Passively Mobile Finite-State Sensors

The computational power of networks of small resource-limited mobile agents is explored. Two new models of computation based on pairwise interactions of finite-state agents in populations of finite but unbounded size are defined. With a fairness condition on interactions, the concept of stable computation of a function or predicate is defined. Protocols are given that stably compute any predica...

متن کامل

Diophantine Equations, Presburger Arithmetic and Finite Automata

We show that the use of nite automata provides a decision procedure for Presburger Arithmetic with optimal worst case complexity.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002